Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Current Result Document :
1
/ 10
´ÙÀ½°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
¹è³¶ ¹®Á¦¸¦ ÀÌ¿ëÇÑ Á¶ÇÕ°æ¸ÅÀÇ ½ÂÀÚ °áÁ¤
¿µ¹®Á¦¸ñ(English Title)
Winner Determination of Combinatorial Auction Using the Knapsack Problem
ÀúÀÚ(Author)
°øÀº¹è
Eun Bae Kong
¿ø¹®¼ö·Ïó(Citation)
VOL 47 NO. 07 PP. 0629 ~ 0634 (2020. 07)
Çѱ۳»¿ë
(Korean Abstract)
Á¶ÇÕ°æ¸Å´Â »óÇ°µéÀÇ Á¶ÇÕ¿¡ ÀÔÂûÀ» ÇÒ ¼ö ÀÖ°Ô ÇÑ´Ù. »óÇ°°£¿¡ »óÈ£ º¸¿Ï¼ºÀÌ ÀÖ´Â °æ¿ì »óÇ°µéÀÇ °¡Ä¡¸¦ Á¤È®ÇÏ°Ô Ç¥ÇöÇÒ ¼ö ÀÖ°Ô ÇÏ¿© °Å·¡¿Í ½ÃÀåÀÇ È¿À²À» ³ôÀÏ ¼ö ÀÖ´Â Áß¿äÇÑ ±â¼úÀÌ´Ù. Á¶ÇÕ°æ¸ÅÀÇ ½ÂÀÚ °áÁ¤ ¹®Á¦(WDP)´Â NP-¿ÏÀü ¹®Á¦·Î ÇØ°áÇÏ±â ¸Å¿ì ¾î·ÆÁö¸¸ Çö½ÇÀûÀ¸·Î ¸¹Àº ºÐ¾ß¿¡ ÀÀ¿ëµÉ ¼ö ÀÖ´Â ¸Å¿ì Áß¿äÇÑ ¹®Á¦ÀÌ´Ù. º» ³í¹®¿¡¼´Â WDP¸¦ ¹è³¶ ¹®Á¦¸¦ ÀÌ¿ëÇÏ¿© ¸¶ÄÚÇÁ üÀÎ ¸óÅ× Ä®·Î ¹æ½ÄÀ» Àû¿ëÇÏ¿© Çظ¦ ±¸ÇÏ´Â ¹æ¾ÈÀ» Á¦½ÃÇÏ¿´´Ù. Á¤¼ö°èȹ¹ý°úÀÇ ºñ±³ ½ÇÇèÀ» ÅëÇØ ÇØÀÇ ¼º´ÉÀÌ Á¤¼ö°èȹ¹ý¿¡ ÀÇÇÑ ÇØ¿¡ ÇÊÀûÇÏ´Â °ÍÀ» È®ÀÎÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
In combinatorial auctions, bidders can make bids on a set of items. When the items show complementarities in values, combinatorial auctions make it possible to express the values more accurately and enhance the market¡¯s efficiency. The winner determination problem is an NP-complete problem. To address this difficult and important problem, we can attempt to solve the special subproblem that can be solved efficiently or develop approximate solutions. In this paper, we reformulated the WDP into a knapsack problem. By using Markov chain Monte Carlo method, we achieved a desired stationary solution with a large objective function. The solution is comparable to that of integer programming
Å°¿öµå(Keyword)
Á¶ÇÕ°æ¸Å
½ÂÀÚ °áÁ¤
¹è³¶ ¹®Á¦
¸¶ÄÚÇÁ üÀÎ ¸óÅ× Ä®·Î
combinatorial auctions
winner determination
knapsack problem
Markov chain Monte Carlo
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.